On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three
نویسندگان
چکیده
منابع مشابه
On parsimonious edge-colouring of graphs with maximum degree three
In a graph G of maximum degree ∆ let γ denote the largest fraction of edges that can be ∆ edge-coloured. Albertson and Haas showed that γ ≥ 13 15 when G is cubic [1]. We show here that this result can be extended to graphs with maximum degree 3 with the exception of a graph on 5 vertices. Moreover, there are exactly two graphs with maximum degree 3 (one being obviously the Petersen graph) for w...
متن کاملOn parcimonious edge-colouring of graphs with maximum degree three
In a graph G of maximum degree ∆ let γ denote the largest fraction of edges that can be ∆ edge-coloured. Albertson and Haas showed that γ ≥ 13 15 when G is cubic . We show here that this result can be extended to graphs with maximum degree 3 with the exception of a graph on 5 vertices. Moreover, there are exactly two graphs with maximum degree 3 (one being obviously the Petersen graph) for whic...
متن کاملA new bound for parsimonious edge-colouring of graphs with maximum degree three
In a graph G of maximum degree 3, let γ(G) denote the largest fraction of edges that can be 3 edge-coloured. Rizzi [9] showed that γ(G) ≥ 1 − 2 3godd(G) where godd(G) is the odd girth of G, when G is triangle-free. In [3] we extended that result to graph with maximum degree 3. We show here that γ(G) ≥ 1− 2 3godd(G)+2 , which leads to γ(G) ≥ 15 17 when considering graphs with odd girth at least ...
متن کاملTools for parsimonious edge-colouring of graphs with maximum degree three
The notion of a δ-minimum edge-colouring was introduced by J-L. Fouquet (in his french PhD Thesis [2]). Here we present some structural properties of δ-minimum edge-colourings, partially taken from the above thesis. The paper serves as an auxiliary tool for another paper submitted by the authors to Graphs and Combinatorics.
متن کاملOn Edge-colouring Indiierence Graphs on Edge-colouring Indiierence Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G)+1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2012
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-012-1145-3